Gaussian-Weighted Moving-Window Robust Automatic Threshold Selection
نویسنده
چکیده
A multi-scale, moving-window method for local thresholding based on Robust Automatic Threshold Selection (RATS) is developed. Using a model for the noise response of the optimal edge detector in this context, the reliability of thresholds computed at di erent scales is determined. The threshold computed at the smallest scale at which the reliability is su cient is used. The performance on 2-D images is evaluated on synthetic an natural images in the presence of varying background and noise. Results show the method deals better with these problems than earlier versions of RATS at most noise levels.
منابع مشابه
Blood vessel segmentation using moving-window robust automatic threshold selection
Two moving-window methods, using either flat or Gaussian weighted windows, for local thresholding with Robust Automatic Threshold Selection are developed. The results show that fast segmentation of blood vessels against a varying background and noise is possible at modest computational cost. Volumes of 128 × 256 and 256 can be segmented in 3.1 s and 6.6 s, for flat, and 12.6 s and 30.8 s for Ga...
متن کاملImproving the performance of MFCC for Persian robust speech recognition
The Mel Frequency cepstral coefficients are the most widely used feature in speech recognition but they are very sensitive to noise. In this paper to achieve a satisfactorily performance in Automatic Speech Recognition (ASR) applications we introduce a noise robust new set of MFCC vector estimated through following steps. First, spectral mean normalization is a pre-processing which applies to t...
متن کاملOptimizing Edge Detectors for Robust Automatic Threshold Selection: Coping with Edge Curvature and Noise
The Robust Automatic Threshold Selection algorithm was introduced as a threshold selection based on a simple image statistic. The statistic is an average of the grey levels of the pixels in an image weighted by the response at each pixel of a specific edge detector. Other authors have suggested that many edge detectors may be used within the context of this method instead. A simple proof of thi...
متن کامل823 Robust repeated median regression in moving windows with data - adaptive width selection
Online (also ’real-time’ or ’sequential’) signal extraction from noisy and outlierinterfered data streams is a basic but challenging goal. Fitting a robust Repeated Median (Siegel, 1982) regression line in a moving time window has turned out to be a promising approach (Davies et al., 2004; Gather et al., 2006; Schettlinger et al., 2006). The level of the regression line at the rightmost window ...
متن کاملNegative Selection Based Data Classification with Flexible Boundaries
One of the most important artificial immune algorithms is negative selection algorithm, which is an anomaly detection and pattern recognition technique; however, recent research has shown the successful application of this algorithm in data classification. Most of the negative selection methods consider deterministic boundaries to distinguish between self and non-self-spaces. In this paper, two...
متن کامل